Bounds on codes over an alphabet of five elements

Bounds on codes over an alphabet of five elements

Bounds on the Size of Equidistant codes over Alphabet of Five and Six Elements

In this paper we consider the problem of finding upper and lower bounds on the size of equidistant codes over alphabet of five and six elements. We present a computer realization of an algorithm for solving the maximum clique problem. The exact values of the maximum size of equidistant codes over an alphabet of 5 and 6 elements for n ≤ 10 are given.

Error-Correcting Codes over an Alphabet of Four Elements

Problems in Network Coding and Error Correcting Codes Appended by a Draft 2001 or before, 8 papers in 2002, 23 papers in 2003 and over 25 papers already work flow problem N2,4,2and (4,4,3) binary error correcting codes, i.e. orthoggraph of a given digraph, and how to combine digraphs or alphabets, we. Abstract. Coding theory deals with the design of error-correcting codes for the reliable over ...

Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements

In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes

Locally recoverable codes (LRC) have recently been a subject of intense research due to the theoretical appeal and their applications in distributed storage systems. In an LRC, any erased symbol of a codeword can be recovered by accessing only few other symbols. For LRC codes over small alphabet (such as binary), the optimal rate-distance trade-off is unknown. We present several new combinatori...